Lattices associated with distance-regular graphs
نویسندگان
چکیده
Let L be a finite set associated with cliques of a distance-regular graph of order (s, t), with d-cliques of Johnson graphs and antipodal distance-regular graphs of diameter d, respectively. If we partially order L by the ordinary inclusion, three families of finite atomic lattices are obtained. This article discusses their geometricity, and computes their characteristic polynomials. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
D-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کاملPooling spaces associated with finite geometry
Motivated by the works of Ngo and Du [H. Ngo, D. Du, A survey on combinatorial group testing algorithms with applications to DNA library screening, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 55 (2000) 171–182], the notion of pooling spaces was introduced [T. Huang, C. Weng, Pooling spaces and non-adaptive pooling designs, Discrete Mathematics 282 (2004) 163–169] for ...
متن کاملDistance-Balanced Closure of Some Graphs
In this paper we prove that any distance-balanced graph $G$ with $Delta(G)geq |V(G)|-3$ is regular. Also we define notion of distance-balanced closure of a graph and we find distance-balanced closures of trees $T$ with $Delta(T)geq |V(T)|-3$.
متن کاملNumber : Title : Lattices Generated by Join of Strongly
Let $\Gamma$ be a $d$-bounded distance-regular graph with $d\geq 3$. Suppose that $P(x)$ is a set of all strongly closed subgraphs containing $x$ and that $P(x,i)$ is a subset of $P(x)$ consisting of the elements of $P(x)$ with diameter $i$. Let ${\mathcal{L}}'(x,i)$ be the set generated by the join of the elements in $P(x,i)$. By ordering ${\mathcal{L}}'(x,i)$ by inclusion or reverse inclusion...
متن کاملRobustness of Random Graphs Based on Natural Connectivity
Recently, it has been proposed that the natural connectivity can be used to efficiently characterise the robustness of complex networks. Natural connectivity quantifies the redundancy of alternative routes in a network by evaluating the weighted number of closed walks of all lengths and can be regarded as the average eigenvalue obtained from the graph spectrum. In this article, we explore the n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 29 شماره
صفحات -
تاریخ انتشار 2008